The Quad-Arc Data Structure
نویسنده
چکیده
In Gold et al. (1996) a simple polygon digitizing technique was described where ‘fringe’ points were digitized around the interior of each map polygon, the Voronoi diagram constructedand the relevant polygon boundary segments extracted from the Voronoi cells. Gold (1997a) extended this to work with scanned map input, where the fringe points were generated automatically, and complete polygon boundary arcs were output. This work has now been extended by replacing the original triangulation data structure with the Quad-Edge structure of Guibas and Stolfi (1985). This has been modified for polygon mapping, and permits the preservation of complete map topology within a simply-generated structure. Its properties permit work on any manifold for any connected graph, and it may be simply coded using an object-oriented language.
منابع مشابه
Optimization of fuzzy membership functions via PSO and GA with application to quad rotor
Quad rotor is a renowned underactuated Unmanned Aerial Vehicle (UAV) with widespread military and civilian applications. Despite its simple structure, the vehicle suffers from inherent instability. Therefore, control designers always face formidable challenge in stabilization and control goal. In this paper fuzzy membership functions of the quad rotor’s fuzzy controllers are optimized using nat...
متن کاملExcitability relationships between lower limb myotatic arcs in spasticity.
The excitability of a lower limb myotatic reflex arc is modulated by the antecedent activation of another myotatic arc in the same limb; the changes can be represented by heteronymous excitability curves. This work compares heteronymous excitability curves in spastic and normal subjects. Eighteen patients who showed clear signs of pyramidal tract lesions at a chronic stage were studied. Three m...
متن کاملQUAD - A Memory Access Pattern Analyser
In this paper, we present the Quantitative Usage Analysis of Data (QUAD) tool, a sophisticated memory access tracing tool that provides a comprehensive quantitative analysis of memory access patterns of an application with the primary goal of detecting actual data dependencies at function-level. As improvements in processing performance continue to outpace improvements in memory performance, to...
متن کاملAn Efficient and Simple Quad Edge Conversion of Polygonal Mainfold Objects
This paper presents an efficient and simple quad edge conversion method of polygonal (manifold) objects. In a wide variety of applications such as scientific visualization, virtual reality and computer aided geometric design, polygonal objects are expected to be visualized and manipulated within a given time constraint. To achieve these expectations, it is necessary to introduce an efficient da...
متن کاملEffectiveness of Sparse Data Structure for Double-Double and Quad-Double Arithmetics
Double-double and quad-double arithmetics are effective tools to reduce the round-off errors in floating-point arithmetic. However, the dense data structure for high-precision numbers in MuPAT/Scilab requires large amounts of memory and a great deal of the computation time. We implemented sparse data types ddsp and qdsp for double-double and quad-double numbers. We showed that sparse data struc...
متن کامل